Efficient Methods for Composite Field Arithmetic
نویسنده
چکیده
We propose new and efficient algorithms for basic arithmetic (squaring, multiplication, and inversion) operations in the Galois fields GF (2) where k is a composite integer as k = nm. These algorithms are suitable for obtaining fast software implementations of the field operations on microprocessors and signal processors, and they are particularly useful for applications in public-key cryptography where k ∈ [160, 512].
منابع مشابه
Efficient Rijndael Encryption Implementation with Composite Field Arithmetic
We explore the use of subfield arithmetic for efficient implementations of Galois Field arithmetic especially in the context of the Rijndael block cipher. Our technique involves mapping field elements to a composite field representation. We describe how to select a representation which minimizes the computation cost of the relevant arithmetic, taking into account the cost of the mapping as well...
متن کاملHygrothermal Analysis of Laminated Composite Plates by Using Efficient Higher Order Shear Deformation Theory
Hygrothermal analysis of laminated composite plates has been done by using an efficient higher order shear deformation theory. The stress field derived from hygrothermal fields must be consistent with total strain field in this type of analysis. In the present formulation, the plate model has been implemented with a computationally efficient C0 finite element developed by using consistent strai...
متن کامل) Multiplier Using Combinational Gates
This paper proposes the design and implementation of GF (2) multiplier using composite field arithmetic. We have introduced an irreducible polynomial X+X+ξ. This irreducible polynomial is required for transforming Galois field of GF (2) to composite field of GF (((2))). Our estimation of the value of ξ and subsequently the composite field arithmetic hence forth derived achieved high speed GF (2...
متن کاملEfficient Algorithms for Elliptic Curve Cryptosystems
Elliptic curves are the basis for a relative new class of public-key schemes. It is predicted that elliptic curves will replace many existing schemes in the near future. It is thus of great interest to develop algorithms which allow efficient implementations of elliptic curve crypto systems. This thesis deals with such algorithms. Efficient algorithms for elliptic curves can be classified into ...
متن کاملA coprocessor for secure and high speed modular arithmetic
We present a coprocessor design for fast arithmetic over large numbers of cryptographic sizes. Our design provides a efficient way to prevent side channel analysis as well as fault analysis targeting modular arithmetic with large prime or composite numbers. These two countermeasure are then suitable both for Elliptic Curve Cryptography over prime fields or RSA using CRT or not. To do so, we use...
متن کامل